On reoptimizing multi-class classifiers
نویسندگان
چکیده
منابع مشابه
Learning Binary Classifiers for Multi-Class Problem
One important idea for the multi-class classification problem is to combine binary classifiers (base classifiers), which is summarized as error correcting output codes (ECOC), and the generalized Bradley-Terry (GBT) model gives a method to estimate the multi-class probability. In this memo, we review the multi-class problem with the GBT model and discuss two issues. First, a new estimation algo...
متن کاملEvasion Attack of Multi-class Linear Classifiers
Machine learning has yield significant advances in decision-making for complex systems, but are they robust against adversarial attacks? We generalize the evasion attack problem to the multi-class linear classifiers, and present an efficient algorithm for approximating the optimal disguised instance. Experiments on real-world data demonstrate the effectiveness of our method.
متن کاملMulti-Class Classifiers and their Underlying Shared Structure
Multi-class problems have a richer structure than binary classification problems. Thus, they can potentially improve their performance by exploiting the relationship among class labels. While for the purposes of providing an automated classification result this class structure does not need to be explicitly unveiled, for human level analysis or interpretation this is valuable. We develop a mult...
متن کاملBlind Multi-class Ensemble Learning with Unequally Reliable Classifiers
The rising interest in pattern recognition and data analytics has spurred the development of innovative machine learning algorithms and tools. However, as each algorithm has its strengths and limitations, one is motivated to judiciously fuse multiple algorithms in order to find the “best” performing one, for a given dataset. Ensemble learning aims at such high-performance meta-algorithm, by com...
متن کاملProbabilistic Discriminative Kernel Classifiers for Multi-class Problems
Logistic regression is presumably the most popular representative of probabilistic discriminative classifiers. In this paper, a kernel variant of logistic regression is introduced as an iteratively re-weighted least-squares algorithm in kernel-induced feature spaces. This formulation allows us to apply highly efficient approximation methods that are capable of dealing with large-scale problems....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2008
ISSN: 0885-6125,1573-0565
DOI: 10.1007/s10994-008-5056-8